An Abstract Way to Define Rewriting Logic

نویسندگان

  • Marc Aiguier
  • Diane Bahrami
  • Delphine Longuet
چکیده

Since rewriting logic has been introduced, it has shown its adequateness both as a semantic and a logical framework. But the numerous applications of the rewriting logic in the above two areas has shown the importance of increasing its expressive power. Therefore, in order to facilitate this work, we will study in this paper how to generalize the transformation that from the equational logic has resulted in the rewriting logic. To achieve this purpose, we will show that there exists a valid and useful notion of rewriting logic associated to any rewriting theory fitting an abstract framework developed by two of the authors in previous papers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rewriting logic as a logical and semantic framework

Rewriting logic 40] is proposed as a logical framework in which other logics can be represented, and as a semantic framework for the speciication of languages and systems. Using concepts from the theory of general logics 39], representations of an object logic L in a framework logic F are understood as mappings L ! F that translate one logic into the other in a conservative way. The ease with w...

متن کامل

A Compositional Semantics for Conditional Term Rewriting Systems

This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context, an equational logic program is viewed as consisting of a set of modules, each module defining a part of the program’s functions. We define a compositional semantics for conditional term rewriting systems which we show...

متن کامل

Residuals in Higher-Order Rewriting

Residuals have been studied for various forms of rewriting and residual systems have been defined to capture residuals in an abstract setting. In this article we study residuals in orthogonal Pattern Rewriting Systems (PRSs). First, the rewrite relation is defined by means of a higher-order rewriting logic, and proof terms are defined that witness reductions. Then, we have the formal machinery ...

متن کامل

Five Basic Concepts of Axiomatic Rewriting Theory

In this invited talk, I will review five basic concepts of Axiomatic Rewriting Theory, an axiomatic and diagrammatic theory of rewriting started 25 years ago in a LICS paper with Georges Gonthier and Jean-Jacques Lévy, and developed along the subsequent years into a full-fledged 2-dimensional theory of causality and residuation in rewriting. I will give a contemporary view on the theory, inform...

متن کامل

Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics

Previously, Soeken and Thomsen presented six basic semantics-preserving rules for rewriting reversible logic circuits, defined using the well-known diagrammatic notation of Feynman. While this notation is both useful and intuitive for describing reversible circuits, its shortcomings in generality complicates the specification of more sophisticated and abstract rewriting rules. In this paper, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 159  شماره 

صفحات  -

تاریخ انتشار 2006